github.com/andybalholm/brotli.histogramDistance.total_count_ (field)

14 uses

	github.com/andybalholm/brotli (current package)
		bit_cost.go#L313: 	if histogram.total_count_ == 0 {
		bit_cost.go#L332: 		return kTwoSymbolHistogramCost + float64(histogram.total_count_)
		bit_cost.go#L374: 		var log2total float64 = fastLog2(histogram.total_count_)
		block_splitter_distance.go#L76: 		insert_cost[i] = fastLog2(uint(uint32(histograms[i].total_count_)))
		brotli_bit_stream.go#L1496: 		buildAndStoreHuffmanTreeFast(dist_histo.data_[:], dist_histo.total_count_, /* max_bits = */
		cluster_distance.go#L36: 	if out[idx1].total_count_ == 0 {
		cluster_distance.go#L39: 	} else if out[idx2].total_count_ == 0 {
		cluster_distance.go#L159: 	if histogram.total_count_ == 0 {
		histogram.go#L108: 	total_count_ uint
		histogram.go#L114: 	self.total_count_ = 0
		histogram.go#L127: 	self.total_count_++
		histogram.go#L131: 	self.total_count_ += n
		histogram.go#L145: 	self.total_count_ += v.total_count_